Some Infinite Classes of Fullerene Graphs
نویسندگان
چکیده
A fullerene graph is a 3 regular planar simple finite graph with pentagon or hexagon faces. In these graphs the number of pentagon faces is 12. Therefore, any fullerene graph can be characterized by number of its hexagon faces. In this note, for any h > 1, we will construct a fullerene graph with h hexagon faces. Then, using the leapfrogging process we will construct stable fullerenes with 20 + 3h hexagon faces, for any h > 1. Mathematics Subject Classification: 92E10
منابع مشابه
Eccentric Connectivity Index of Some Dendrimer Graphs
The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملNew Expansion for Certain Isomers of Various Classes of Fullerenes
This paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. Furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.
متن کاملCentrosymmetric graphs and a lower bound for graph energy of fullerenes
The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to ...
متن کامل